Strong orientations without even directed circuits
نویسندگان
چکیده
We characterize the graphs for which all 2-connected non-bipartite subgraphs have a strongly connected orientation in which each directed circuit has an odd number of edges. We also give a polynomial-time algorithm to find such an orientation in these graphs. Moreover, we give an algorithm that given any orientation of such a graph, determines if it has an even directed circuit. The proofs of these results are based on a constructive characterization of these graphs.
منابع مشابه
Strong structural properties of unidirectional star graphs
Day and Tripathi [K. Day, A. Tripathi, Unidirectional star graphs, Inform. Process. Lett. 45 (1993) 123–129] proposed an assignment of directions on the star graphs and derived attractive properties for the resulting directed graphs: an important one is that they are strongly connected. In [E. Cheng, M.J. Lipman, On the Day–Tripathi orientation of the star graphs: Connectivity, Inform. Process....
متن کاملBipolar orientations Revisited
Acyclic orientations with exactly one source and one sink ~ the so-called bipolar orientations _ arise in many graph algorithms and specially in graph drawing. The fundamental properties of these orientations are explored in terms of circuits, cocircuits and also in terms of “angles” in the planar case. Classical results get here new simple proofs; new results concern the extension of partial o...
متن کاملPermanents, Pfaffian Orientations, and Even Directed Circuits
Given a 0-1 square matrix A, when can some of the 1’s be changed to −1’s in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either have the same sign or are both zero) is nonsingular? When is a hypergraph with n vertices and n h...
متن کاملPfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs
The following issues in computational complexity remain imprecisely understood: The striking difference in the complexities of computing the permanent and determinant of a matrix despite their similar looking formulae, the complexity of checking if a directed graph contains an even length cycle, and the complexity of computing the number of perfect matchings in a graph using Pfaffian orientatio...
متن کاملMinimum entropy orientations
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp (Theoret. Comput. Sci., 2005) and by the current authors (Algorithmica, to appear). We prove that the minimum entropy orientation problem is NP-hard even if the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 188 شماره
صفحات -
تاریخ انتشار 1998